The Sliding-Window Protocol in CSP
نویسنده
چکیده
A formal specification and proof of correctness is given of the sliding window protocol using the notation of Communicating Sequential Pro cesses. First the stop-and-wait protocol is defined; its correetne8S, that it forms a I-place buffer, is almost evident. Next the alternating-bit protocol is defined and described in terms of the stop-and-wait proto col, and its correctness deduced. Finally the sliding-window protocol is described in terms of the alternating-bit protocol and its correctness deduced accordingly. The protocols are refined, and implemented in occam. The paper has two thrusts: that modularity of a specification helps to structure proofs about it (in this case, proofs that the protocols implement bUffers); and that refinement in CSP leads to structured, correct implementations in occam.
منابع مشابه
FDiBC: A Novel Fraud Detection Method in Bank Club based on Sliding Time and Scores Window
One of the recent strategies for increasing the customer’s loyalty in banking industry is the use of customers’ club system. In this system, customers receive scores on the basis of financial and club activities they are performing, and due to the achieved points, they get credits from the bank. In addition, by the advent of new technologies, fraud is growing in banking domain as well. Therefor...
متن کاملModeling and Performance Analysis of a Sliding Window Protocol
The sliding window algorithm is widely used in many standard network protocols. It can ensure a correct data transfer over unreliable channels where packets may be duplicated, lost, or re-ordered. By now only few papers have presented the performance of the sliding window protocol. A number of parameters affecting the overall performance of the system still need to be investigated systematicall...
متن کاملFormal Model and Analysis of Sliding Window Protocol Based on NuSMV
System states space based on Kripke structure can be exhausted by model checking, thus system key property described by temporal logic can be automatically verified. Presently model checking has been widely used in hardware validation and network protocol analysis. Sliding window protocol is a classical receive-send protocol, which is used in TCP/IP protocol group. In this paper, we propose the...
متن کاملVerifying a Sliding Window Protocol in µCRL
We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. We show that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory, and was checked with the help of PVS.
متن کاملMining Frequent Patterns in Uncertain and Relational Data Streams using the Landmark Windows
Todays, in many modern applications, we search for frequent and repeating patterns in the analyzed data sets. In this search, we look for patterns that frequently appear in data set and mark them as frequent patterns to enable users to make decisions based on these discoveries. Most algorithms presented in the context of data stream mining and frequent pattern detection, work either on uncertai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009